Efficient and Generic Construction of Certification-Based Encryption in the Standard Model Based on the NIZK Proof System

نویسنده

  • Yang Lu
چکیده

Certificate-based encryption (CBE) is a new public key encryption paradigm which combines traditional PKI-based public-key encryption (PKE) and identity-based encryption (IBE), and preserves some of their most attractive features. CBE provides an efficient implicit certificate mechanism and allows a periodical update of certificate status. It eliminates third-party queries for the certificate status and simplifies the certificate revocation problem in the traditional PKI, while it solves the key escrow problem and the key distribution problem inherent in IBE. In this paper, we propose a new generic construction of CBE schemes from PKE and IBE, and prove it to be CCA-secure in the standard model. In our construction, we use an efficient one-time simulation-sound adaptive NIZK proof system as the security enhancing building block to guarantee the CCA-security of the generated CBE schemes. When compared to the previous method, the security requirements of the primitive encryption schemes in our construction are much weaker and the performance of the generated CBE schemes from our construction is much more efficient.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Non-malleability of the Fiat-Shamir Transform

The Fiat-Shamir transform is a well studied paradigm for removing interaction from publiccoin protocols. We investigate whether the resulting non-interactive zero-knowledge (NIZK) proof systems also exhibit non-malleability properties that have up to now only been studied for NIZK proof systems in the common reference string model: first, we formally define simulation soundness and a weak form ...

متن کامل

Tightly-Secure Signatures from Chameleon Hash Functions

We give a new framework for obtaining signatures with a tight security reduction from standardhardness assumptions. Concretely, we show that any Chameleon Hash function can be transformedinto a (binary) tree-based signature scheme with tight security. The transformation is in the standardmodel, i.e., it does not make use of any random oracle. For specific assumptions (such as RSA,<l...

متن کامل

Convertible limited (multi-) verifier signature: new constructions and applications

A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...

متن کامل

A New Method for Encryption of Color Images based on Combination of Chaotic Systems

This paper presents a new method for encryption of color images based on a combination of chaotic systems, which makes the image encryption more efficient and robust. The proposed algorithm generated three series of data, ranged between 0 and 255, using a chaotic Chen system. Another Chen system was then started with different initial values, which were converted to three series of numbers from...

متن کامل

Designated Verifier Nizks

Last Time: Simulation Sound NIZKS & Connection to CCA Security. Last time we introduced Simulation-Sound NIZKs, and constructed a 1-Time Simulation Sound NIZK (1-SS NIZK). We then showed how to get CCA secure encryption from CPA encryption and NIZKs in one of two ways: using standard NIZK and n copies of a CPA encryption scheme ([DDN00]) or using 1-SS NIZK and 2 copies of a CPA encryption schem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JNW

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012